recursion theoremの例文

例文

もっと例文:   1  2  3  4  5

1. The second recursion theorem can be applied to any total recursive function.
2. The second part of the first recursion theorem follows from the first part.
3. To apply the first recursion theorem, the recursion equations must first be recast as a recursive operator.
4. A classic example using the second recursion theorem is the function Q ( x, y ) = x.
5. Quines are possible in any Turing complete programming language, as a direct consequence of Kleene's recursion theorem.